A Routing Protocol for Anycast Messages
نویسندگان
چکیده
ÐAn anycast packet is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. Little work has been done on routing anycast packets. In this paper, we propose and analyze a routing protocol for anycast message. It is composed of two subprotocols: the routing table establishment subprotocol and the packet forwarding subprotocol. In the routing table establishment subprotocol, we propose four methods (SSP, MIN-D, SBT, and CBT) for enforcing an order among routers for the purpose of loop prevention. These methods differ from each other on information used to maintain orders, the impact on QoS, and the compatibility to the existing routing protocols. In the packet forwarding subprotocol, we propose a Weighted-Random Selection (WRS) approach for multiple path selection in order to balance network traffic. In particular, the fixed and adaptive methods are proposed to determine the weights. Both of them explicitly take into account the characteristics of distribution of anycast recipient group while the adaptive method uses the dynamic information of the anycast traffic as well. Correctness property of the protocol is formally proven. Extensive simulation is performed to evaluate our newly designed protocol. Performance data shows that the loop-prevention methods and the WRS approaches have great impact on the performance in terms of average end-to-end packet delay. In particular, the protocol using the SBT or CBT loop-prevention methods and the adaptive WRS approach performs very close to a dynamic optimal routing protocol in most cases. Index TermsÐAnycast message, multiple path routing, shortest path first, weight assignment.
منابع مشابه
Integrated Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for rout ing anycast packets. Single-path routing always uses the same path for anycast packets from a source, while multipath routing splits anycast traffic into several different paths. The former is simple and easy to implement, while the latter may potentially reduce congestion, impr...
متن کاملDesign and Implement of SD-Anycast Routing Protocol
Basing on the analysis of the studying situation of current routing protocol , this thesis presents a SD-Anycast protocol algorithm, and the routing principle and measure parameter of the protocol is given. By designing packet header, routing maintaining and node dealing modules, it implements this protocol in NS2. Lastly, some quantificational experiments indicate that this routing protocol al...
متن کاملPIA-SM: multicast based IPv6 anycast routing protocol
Today, the use of anycast address is quite limited. One of the reasons is that there is no routing protocol providing a global anycasting service. In this paper we design and implement a new anycast routing protocol called PIA-SM (Protocol Independent Anycast – Sparse Mode). We focus on PIM-SM (Protocol Independent Multicast – Sparse Mode), which is one of multicast routing protocols available ...
متن کاملProtocol Design for Anycast Communication in IPv6 Network
Although anycast communication supports service– oriented addresses many of its current definitions in IPv6 are unclear. Furthermore, since there are no protocol standards or even consensus on routing control, inter–segment anycast communications are not yet available. In this paper, we first discuss these problems and solutions. Based on our findings, we present the Anycast Address Resolving P...
متن کاملDesign and implementation of routing protocols for IPv6 global anycast communications
Anycast is a new IPv6 feature that supports service–oriented address assignments in IPv6 networks. However, because there are no protocol standards or even consensus on routing protocols, inter–segment anycast communications are not yet available. In this paper, we first discuss problems and solutions on inter–segment anycast communications. Based on our findings, we propose two routing protoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 11 شماره
صفحات -
تاریخ انتشار 2000